Combinatorics and Algorithms for Quasi-Chain Graphs

Abstract The class of quasi-chain graphs is an extension the well-studied chain graphs. This latter enjoys many nice and important properties, such as bounded clique-width, implicit representation, well-quasi-ordering by induced subgraphs, etc. substantially more complex. In particular, this not well-quasi-ordered clique-width in it. present paper, we show that universe at least complex permutations establishing a bijection between all subclass implies, subgraph isomorphism problem NP-complete for On other hand, propose decomposition theorem implies representation efficient solutions some algorithmic problems are generally intractable.